Creating an Upper-Confidence-Tree Program for Havannah
نویسندگان
چکیده
Monte-Carlo Tree Search and Upper Confidence Bounds provided huge improvements in computer-Go. In this paper, we test the generality of the approach by experimenting on another game, Havannah, which is known for being especially difficult for computers. We show that the same results hold, with slight differences related to the absence of clearly known patterns for the game of Havannah, in spite of the fact that Havannah is more related to connection games like Hex than to territory games like Go.
منابع مشابه
Monte-carlo Tree Search for the “mr Jack” Board Game
Recently the use of the Monte-Carlo Tree Search algorithm, and in particular its most famous implementation, the Upper Confidence Tree can be seen has a key moment for artificial intelligence in games. This family of algorithms provides huge improvements in numerous games, such as Go, Havannah, Hex or Amazon. In this paper we study the use of this algorithm on the game of Mr Jack and in particu...
متن کاملMonte-Carlo Tree Search for the Game of "7 Wonders"
Monte-Carlo Tree Search algorithm, and in particular with the Upper Confidence Bounds formula, provided huge improvements for AI in numerous games, particularly in Go, Hex, Havannah, Amazons and Breakthrough. In this work we study this algorithm on a more complex game, the game of “7 Wonders”. This card game gathers together several known difficult features, such as hidden information, N-player...
متن کاملMonte-Carlo Tree Search Enhancements for Havannah
This article shows how the performance of a Monte-Carlo Tree Search (MCTS) player for Havannah can be improved, by guiding the search in the play-out and selection steps of MCTS. To improve the play-out step of the MCTS algorithm, we used two techniques to direct the simulations, Last-Good-Reply (LGR) and N-grams. Experiments reveal that LGR gives a significant improvement, although it depends ...
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملScalability and Parallelization of Monte-Carlo Tree Search
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of parallelization, in particular for our program MoGo but also for our Havannah program Shakti. In particular, we get a good efficiency for the parallel versions, both for multicore machines and for message-passing machin...
متن کامل